A practical application of simulated annealing to clustering
نویسندگان
چکیده
-We formalize clustering as a partitioning problem with a user-defined internal clustering criterion and present SINICC, an unbiased, empirical method for comparing internal clustering criteria. An application to multi-sensor fusion is described, where the data set is composed of inexact sensor "reports" pertaining to "objects" in an environment. Given these reports, the objective is to produce a representation of the environment, where each entity in the representation is the result of "fusing" sensor reports. Before one can perform fusion, however, the reports must be "associated" into homogeneous clusters. Simulated annealing is used to find a near-optimal partitioning with respect to each of several clustering criteria for a variety of simulated data sets. This method can then be used to determine the "best" clustering criterion for the multi-sensor fusion problem with a given fusion operator. Partitional clustering Simulated annealing Sensor fusion Clustering criteria evaluation
منابع مشابه
Simulated annealing and artificial immune system algorithms for cell formation with part family clustering
Cell formation problem (CFP) is one of the main problems in cellular manufacturing systems. Minimizing exceptional elements and voids is one of the common objectives in the CFP. The purpose of the present study is to propose a new model for cellular manufacturing systems to group parts and machines in dedicated cells using a part-machine incidence matrix to minimize the voids. After identifying...
متن کاملA Clustering Based Location-allocation Problem Considering Transportation Costs and Statistical Properties (RESEARCH NOTE)
Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...
متن کاملClustering Using Annealing Evolution: Application to Pixel Classification of Satellite Images
In this article an efficient clustering technique, that utilizes an effective integration of simulated annealing and evolutionary programming as the underlying search tool, is developed. During the evolution process, data points are redistributed among the clusters probabilistically so that points that are farther away from the cluster center have higher probabilities of migrating to other clus...
متن کاملA New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks
In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...
متن کاملAdaptive neuro-fuzzy inference system and neural network in predicting the size of monodisperse silica and process optimization via simulated annealing algorithm
In this study, Back-propagation neural network (BPNN) and adaptive neuro-fuzzy inference system (ANFIS) methods were applied to estimate the particle size of silica prepared by sol-gel technique. Simulated annealing algorithm (SAA) employed to determine the optimum practical parameters of the silica production. Accordingly, the process parameters, i.e. tetraethyl orthosilicate (TEOS), H2O and N...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 25 شماره
صفحات -
تاریخ انتشار 1992